An exact accelerated stochastic simulation algorithm
نویسندگان
چکیده
منابع مشابه
An exact accelerated stochastic simulation algorithm.
An exact method for stochastic simulation of chemical reaction networks, which accelerates the stochastic simulation algorithm (SSA), is proposed. The present "ER-leap" algorithm is derived from analytic upper and lower bounds on the multireaction probabilities sampled by SSA, together with rejection sampling and an adaptive multiplicity for reactions. The algorithm is tested on a number of wel...
متن کاملA Hierarchical Exact Accelerated Stochastic Simulation Algorithm
A new algorithm, "HiER-leap" (hierarchical exact reaction-leaping), is derived which improves on the computational properties of the ER-leap algorithm for exact accelerated simulation of stochastic chemical kinetics. Unlike ER-leap, HiER-leap utilizes a hierarchical or divide-and-conquer organization of reaction channels into tightly coupled "blocks" and is thereby able to speed up systems with...
متن کاملGPU Accelerated Stochastic Simulation
Through computational methods, biologists are able learn more about molecular biology by building accurate models. These models represent and predict the reactions among species populations within a system. One popular method to develop predictive models is to use a stochastic, Monte Carlo method developed by Gillespie called the stochastic simulation algorithm (SSA). Since this algorithm is ba...
متن کاملQuateXelero: An Accelerated Exact Network Motif Detection Algorithm
Finding motifs in biological, social, technological, and other types of networks has become a widespread method to gain more knowledge about these networks' structure and function. However, this task is very computationally demanding, because it is highly associated with the graph isomorphism which is an NP problem (not known to belong to P or NP-complete subsets yet). Accordingly, this researc...
متن کامل$S$-Leaping: An adaptive, accelerated stochastic simulation algorithm, bridging $\tau$-leaping and $R$-leaping
We propose the S-leaping algorithm for the acceleration of Gillespie’s stochastic simulation algorithm that combines the advantages of the two main accelerated methods; the τ -leaping and R-leaping algorithms. These algorithms are known to be efficient under different conditions; the τ -leaping is efficient for non-stiff systems or systems with partial equilibrium, while the R-leaping performs ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Journal of Chemical Physics
سال: 2009
ISSN: 0021-9606,1089-7690
DOI: 10.1063/1.3078490